Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
641	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
642	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
643	Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:18 Clique Cograph K-tree Matching Maximal independent set Clique-sum Graph theory Graph operations NP-complete problems
644	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2008-09-22 04:53:24 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics
645	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
646	Summary of APA Style for Writing Research Reports All reports must be typed in APA 6th edition format. Complete specifications can be found in the APA style manual available in the bookstore or at the reference desk i Add to Reading List Source URL: www.muhlenberg.edu Language: English - Date: 2009-10-27 13:57:24 APA style Statistical hypothesis testing Type theory Statistics Analysis of variance Two-way analysis of variance
647	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
648	A Refined Complexity Analysis of Degree Anonymization in GraphsI Sepp Hartunga , Andr´e Nichterleina , Rolf Niedermeiera , Ondˇrej Such´ yb a Institut Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-29 07:15:40 NP-complete problems Kernelization Graph coloring Clique Independent set Degree Neighbourhood Degeneracy Parameterized complexity Graph theory Theoretical computer science Mathematics
649	On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-05-18 17:31:04 Search algorithms Pursuit-evasion game theory Shortest path problem NP-complete Planar graph Breadth-first search Binary tree Depth-first search Graph theory Theoretical computer science Mathematics
650	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics

UPDATE